Approximating sliding windows by cyclic tree-like histograms for efficient range queries
نویسندگان
چکیده
منابع مشابه
Approximating sliding windows by cyclic tree-like histograms for efficient range queries
The issue of providing fast approximate answers to range queries on sliding windows with a small consumption of storage space is one of the main challenges in the context of data streams. On the one hand, the importance of this class of queries is widely accepted. They are indeed useful to compute aggregate information over the data stream, allowing us to extract from it more abstract knowledge...
متن کاملReducing Data Stream Sliding Windows by Cyclic Tree-Like Histograms
Data reduction is a basic step in a KDD process useful for delivering to successive stages more concise and meaningful data. When mining is applied to data streams, that are continuous data flows, the issue of suitably reducing them is highly interesting, in order to arrange effective approaches requiring multiple scans on data, that, in such a way, may be performed over one or more reduced sli...
متن کاملCRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries
We propose a new indexing scheme, called the CRB-tree, for efficiently answering range-aggregate queries. The range-aggregate problem is defined as follows: Given a set of weighted points in R, compute the aggregate of weights of points that lie inside a d-dimensional query rectangle. In this paper we focus on range-COUNT, SUM, AVG aggregates. First, we develop an indexing scheme for answering ...
متن کاملEfficient Summing over Sliding Windows
This paper considers the problem of maintaining statistic aggregates over the last W elements of a data stream. First, the problem of counting the number of 1’s in the last W bits of a binary stream is considered. A lower bound of Ω( 1 +logW ) memory bits forW -additive approximations is derived. This is followed by an algorithm whose memory consumption is O( 1 + logW ) bits, indicating that th...
متن کاملEfficient Error-Correcting Codes for Sliding Windows
We consider the task of transmitting a data stream in the sliding window model, where communication takes place over an adversarial noisy channel with noise rate up to 1. For any noise level c < 1 we design an efficient encoding scheme, such that for any window in which the noise level does not exceed c, the receiving end decodes at least a (1−c−ε)-prefix of the window, for any small ε > 0. Dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data & Knowledge Engineering
سال: 2010
ISSN: 0169-023X
DOI: 10.1016/j.datak.2010.05.002